Paradox Algorithm in Application of a Linear Transportation Problem
نویسندگان
چکیده
منابع مشابه
Paradox in a Non-linear Capacitated Transportation Problem
This paper discusses a paradox in fixed charge capacitated transportation problem where the objective function is the sum of two linear fractional functions consisting of variables costs and fixed charges respectively. A paradox arises when the transportation problem admits of an objective function value which is lower than the optimal objective function value, by transporting larger quantities...
متن کاملUncertainty in linear fractional transportation problem
In this paper, we study the linear fractional transportation problem with uncertain arameters. After recalling some definitions, concepts and theorems in uncertainty theory we present three approaches for solving this problem. First we consider the expected value of the objective function together with the expectation of satisfying constraints. Optimizing the expected value of the objective fun...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملA Grey Transportation Problem in Fuzzy Environment
In classical transport models, it is always assumed that parameters such as the distance from each supply node to each demand node or the cost of transferring goods from one node to another, as well as quantities such as supply and demand are definite and definite amounts. But in real matters, considering these assumptions is not logical. On the other hand, there may be a real problem in mathem...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Applied Mathematics and Statistics
سال: 2014
ISSN: 2328-7306
DOI: 10.12691/ajams-2-1-3